On distance edge colourings of a cyclic multigraph
نویسنده
چکیده
We shall use the distance chromatic index defined by the present author in early nineties, cf. [5] or [4] of 1993. The edge distance of two edges in a multigraph M is defined to be their distance in the line graph L(M) of M . Given a positive integer d, define the d+-chromatic index of the multigraph M , denoted by q(d)(M), to be equal to the chromatic number χ of the dth power of the line graph L(M),
منابع مشابه
Delay Colourings of Cubic Graphs
In this note we prove the conjecture of Wilfong, Haxell and Winkler (2001) that every bipartite multigraph with integer edge delays admits an edge colouring with d + 1 colours in the special case where d = 3. A connection to the Brualdi-RyserStein conjecture is discussed.
متن کاملFrugal Colouring of Graphs
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several wel...
متن کاملSome maximum multigraphs and adge/vertex distance colourings
Shannon–Vizing–type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree ∆(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d–index and chromatic d–number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their gro...
متن کاملList Edge Colourings of Some 1-Factorable Multigraphs
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSej = k, we can choose elements se 2 Se such that se 6 = sf whenever e and f are adjacent edges. Using a technique of Alon and Tarsi which involves the graph monomial Q fxu ? xv : uv 2 Eg of an oriented graph, we verify this conjecture for certain families...
متن کاملList Edge and List Total Colourings of Multigraphs
This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B 63 (1995), 153 158), who proved that the list edge chromatic number /$list(G) of a bipartite multigraph G equals its edge chromatic number /$(G). It is now proved here that if every edge e=uw of a bipartite multigraph G is assigned a list of at least max[d(u), d(w)] colours, then G can be edge-coloured with each e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 19 شماره
صفحات -
تاریخ انتشار 1999